Optimal solution characterization for infinite positive semi-definite programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new positive definite semi-discrete mixed finite element solution for parabolic equations

In this paper, a positive definite semi-discrete mixed finite element method was presented for two-dimensional parabolic equations. In the new positive definite systems, the gradient equation and flux equations were separated from their scalar unknown equations.  Also, the existence and uniqueness of the semi-discrete mixed finite element solutions were proven. Error estimates were also obtaine...

متن کامل

A numerical approach for optimal control model of the convex semi-infinite programming

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.

متن کامل

A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

متن کامل

Positive Semi-definite Programming Localization in Wireless Sensor Networks

We propose an algorithm to locate an object with unknown coordinates based on the positive semi-definite programming in the wireless sensor networks, assuming that the squared error of the measured distance follows Gaussian distribution. We first obtain the estimator of the object location; then transform the non-convex problem to convex one by the positive semi-definite relaxation; and finally...

متن کامل

Positive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems

In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1994

ISSN: 0893-9659

DOI: 10.1016/0893-9659(94)90013-2